Barrakuda: A Hybrid Evolutionary Algorithm for Minimum Capacitated Dominating Set Problem
نویسندگان
چکیده
منابع مشابه
Approximability of the capacitated b-edge dominating set problem
In this paper, we discuss the approximability of the capacitated b-edge dominating set problem, which generalizes the edge dominating set problem by introducing capacities and demands on the edges. We present an approximation algorithm for this problem and show that it achieves a factor of 8/3 for general graphs and a factor of 2 for bipartite graphs. Moreover, we discuss the relationships of t...
متن کاملA greedy approximation algorithm for the minimum (2, 2)-connected dominating set problem
Using a connected dominating set (CDS) to serve as the virtual backbone of a wireless sensor network (WSN) is an effective way to save energy and reduce the impact of broadcasting storms. Since nodes may fail due to accidental damage or energy depletion, it is desirable that the virtual backbone is fault tolerant. This could be modeled as a k-connected, m-fold dominating set ((k,m)-CDS). Given ...
متن کاملA Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem
This article presents an evolutionary algorithm (EA) for the capacitated minimum spanning tree problem occurring in telecommunication applications. The EA encodes a solution by a predecessor vector indicating for each node the preceding node at the path to the given central root node. Initialization, crossover, and mutation operators were specifically designed to provide strong locality and to ...
متن کاملSimple Bounds for the Minimum Dominating Trail Set problem
Given a graph G, the Minimum Dominating Trail Set (MDTS) problem consists in ̄nding a minimum cardinality collection of pairwise edge-disjoint trails such that each edge of G has at least one endvertex on some trail. The MDTS problem is NP{hard for general graphs. In this paper lower and upper bounds for the MDTS problem on general graphs are presented.
متن کاملAlgorithms for Minimum m -Connected k -Dominating Set Problem
In wireless sensor networks, virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high efficiency, which is modelled as the minimum Connected Dominating Set (CDS) problem. In this paper we consid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8111858